STaR: design and quantitative measurement of source-location privacy for wireless sensor networks
نویسندگان
چکیده
Wireless sensor networks (WSNs) can provide the world with a technology for real-time event monitoring. One of the primary concerns that hinder the successful deployment of WSNs is source-location privacy (SLP). The privacy of the source location is vital and highly jeopardized by the usage of wireless communications. Although message content privacy can be ensured through message encryption, it is much more difficult to adequately address the SLP. For WSNs, SLP service is further complex by the fact that sensors consist of low-cost and energy-efficient radio devices. Therefore, using computationally intensive cryptographic algorithms (such as public-key cryptosystems) and large-scale broadcasting-based protocols are not suitable for WSNs. In this paper, we analyze the quantitatively measure source-location information leakage in routing-based SLP protection schemes for WSNs. Through this model, we identify vulnerabilities of some well-known SLP protection schemes. We also propose a routing technique, called the Sink Toroidal Region (STaR), to provide adequate SLP with low energy consumption. With this routing technique, the source node randomly selects an intermediate node within a designed STaR area located around the sink node. Furthermore, this routing protocol ensures that the intermediate node is neither too close, nor too far from the sink node in relations to the entire network. While ensuring SLP, our simulation results show that the proposed scheme is very efficient and can be used for practical applications. Copyright © 2012 John Wiley & Sons, Ltd.
منابع مشابه
Sink Location Service Based on Fano Plane in Wireless Sensor Networks
Sink location is considered as a basic service in geographic routing in wireless sensor networks. Obtaining the location of sink node by source node using an efficient method with low complexity has always been a challenging issue in research. In this paper, a sink location algorithm based on Fano plane is proposed. The research challenge is how to ensure the intersection of two SLQ (Location Q...
متن کاملDesign and evaluation of two distributed methods for sensors placement in Wireless Sensor Networks
Adequate coverage is one of the main problems for distributed wireless sensor networks and The effectiveness of that highly depends on the sensor deployment scheme. Given a finite number of sensors, optimizing the sensor deployment will provide sufficient sensor coverage and save power of sensors for movement to target location to adequate coverage. In this paper, we apply fuzzy logic system to...
متن کاملDesign and evaluation of two distributed methods for sensors placement in Wireless Sensor Networks
Adequate coverage is one of the main problems for distributed wireless sensor networks and The effectiveness of that highly depends on the sensor deployment scheme. Given a finite number of sensors, optimizing the sensor deployment will provide sufficient sensor coverage and save power of sensors for movement to target location to adequate coverage. In this paper, we apply fuzzy logic system to...
متن کاملA Hierarchy Topology Design Using a Hybrid Evolutionary Algorithm in Wireless Sensor Networks
Wireless sensor network a powerful network contains many wireless sensors with limited power resource, data processing, and transmission abilities. Wireless sensor capabilities including computational capacity, radio power, and memory capabilities are much limited. Moreover, to design a hierarchy topology, in addition to energy optimization, find an optimum clusters number and best location of ...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Security and Communication Networks
دوره 9 شماره
صفحات -
تاریخ انتشار 2016